Multi-Dimensional Bloom Filter: Design and Evaluation
نویسندگان
چکیده
منابع مشابه
Design of Multi-Dimensional Filter Banks
The problem of the design of multi-dimensional filter banks with prescribed properties is considered. The most important requirements are perfect reconstruction property, linear phase property, optimization for a given class of signals, maximum number of vanishing moments and others. A survey of different approaches to the problem of filter banks’ design is presented. The most promising ones ar...
متن کاملStable multi-dimensional model reduction and IIR filter design
Abstract: It is well-known that model reduction techniques applied to stable multi-dimensional Linear Shift-Invariant (LSI) systems with Infinite-extent Impulse Response (IIR) do not necessarily guarantee a stable reduced system. Several conditions exist to check stability a posteriori. In this paper we outline a new technique that guarantees, a priori, that the system or filter is stable. In S...
متن کاملFast Multi-dimensional Filter Networks Design, Optimization and Implementation
As the title implies a fast filter network is a structure of filters, designed for efficient computation of a set of multi-dimensional filters. The efficiency is due to decomposition of multi-dimensional filter sets into a structure of smaller sparse filters called sub-filters. The structure used, forms a directed acyclic graph which allows the sub-filters to contribute to several output nodes ...
متن کاملA Cuckoo Filter Modification Inspired by Bloom Filter
Probabilistic data structures are so popular in membership queries, network applications, and so on. Bloom Filter and Cuckoo Filter are two popular space efficient models that incorporate in set membership checking part of many important protocols. They are compact representation of data that use hash functions to randomize a set of items. Being able to store more elements while keeping a reaso...
متن کاملThe Gaussian Bloom Filter
Modern databases tailored to highly distributed, fault tolerant management of information for big data applications exploit a classical data structure for reducing disk and network I/O as well as for managing data distribution: The Bloom filter. This data structure allows to encode small sets of elements, typically the keys in a key-value store, into a small, constant-size data structure. In or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2017
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2016inp0022